منابع مشابه
Considering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کاملLearning Combinatorial Optimization Algorithms over Graphs
Many combinatorial optimization problems over graphs are NP-hard, and require significant specialized knowledge and trial-and-error to design good heuristics or approximation algorithms. Can we automate this challenging and tedious process, and learn the algorithms instead? In many real world applications, it is typically the case that the same type of optimization problem is solved again and a...
متن کاملCombinatorial Optimization on Graphs of Bounded Treewidth
There are many graph problems that can be solved in linear or polynomial time with a dynamic programming algorithm when the input graph has bounded treewidth. For combinatorial optimization problems, this is a useful approach for obtaining fixed-parameter tractable algorithms. Starting from trees and series-parallel graphs, we introduce the concepts of treewidth and tree decompositions, and ill...
متن کاملCombinatorial Optimization for Infinite Games on Graphs
Björklund, H. 2005. Combinatorial Optimization for Infinite Games on Graphs. Acta Universitatis Upsaliensis. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 3. vi, 51 pp. Uppsala. ISBN 91-554-6129-8 Games on graphs have become an indispensable tool in modern computer science. They provide powerful and expressive models for numerous phenomena a...
متن کاملCombinatorial Optimization on k-Connected Graphs
The topic of network design occupies a central place in Combinatorial Optimization. There are a number of key open questions pertaining to k-node connected graphs on topics such as minimum-cost k-connected spanning subgraphs, connectivity augmentation, and orientations. These questions/conjectures are analogous to similar statements for edge connectivity. Most of the statements for edge connect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2006
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2006.05.001